There are exactly five biplanes with k=11

نویسندگان

  • Patric R. J. Östergård
  • Petteri Kaski
چکیده

A biplane is a 2-(k(k − 1)/2 + 1, k, 2) symmetric design. Only sixteen nontrivial biplanes are known: there are exactly nine biplanes with k < 11, at least five biplanes with k = 11, and at least two biplanes with k = 13. It is here shown by exhaustive computer search that the list of five known biplanes with k = 11 is complete. This result further implies that there exists no 3-(57, 12, 2) design, no 11211 symmetric configuration, and no (324, 57, 0, 12) strongly regular graph. The five biplanes have 16 residual designs, which by the Hall–Connor theorem constitute a complete classification of the 2-(45, 9, 2) designs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refined Deterministic Algorithm for Biplane Construction

This paper introduces a way of constructing biplanes that uses “filters” in a step prior to an exhaustive computer search, with the objective to make the biplane construction more efficient. The achieved deterministic algorithm classifies biplanes of order 7 and smaller. When performing the search using some additional presumptive conditions, two biplanes of order 9 (k = 11) were constructed an...

متن کامل

Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures

A hnite. indecomposabic partially ordered set is said to be critically indecomposahlc if. whenever an clement is removed. the resulting induced partially ordered set is not indccomposabic. The same terminology can be applied to graphs. tournaments, or any other relational structure whose relations are binary and irrcflexive. It will be shown in this paper that critically indecomposable partiall...

متن کامل

A class of functions and their application in constructing semi-biplanes and association schemes

We give an alternative proof of the fact that a planar function cannot exist on groups of even order. The argument involved leads us to define a class of functions which we call semi-planar. Through the introduction of an incidence structure we construct semi-biplanes using semi-planar functions. The method involved represents a new approach to constructing semi-biplanes and provides infinite c...

متن کامل

Biplanes with flag-transitive automorphism groups of almost simple type, with alternating or sporadic socle

In this paper we prove that there cannot be a biplane admitting a primitive, flagtransitive automorphism group of almost simple type, with alternating or sporadic socle.

متن کامل

An extremal problem related to biplanes

The existence problem for biplanes has proved to be intractable: only finitely many are known. However, it can be turned into an extremal problem, on which some progress can be made. A biplane is a set of subsets (blocks) of {I, ... , n} such that (a) any two blocks meet in two points; (b) any two points lie in two blocks. It is easy to see that, for some integer k, every block of a biplane con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2006